Efficient squaring circuit using canonical signed-digit number representation

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Efficient squaring circuit using canonical signed-digit number representation

Squaring and exponentiation of a number are fundamental arithmetic and widely used in the real-time applications such as image processing, digital filtering and cryptography. In this paper, we propose a squaring algorithm of an integer with canonical signed-digit (CSD) number representation. For an n-digit CSD number, our method generates n/4 CSD numbers of 2n-digit length as partial products. ...

متن کامل

Efficient transform using canonical signed digit in reversible color transforms

bstract. Color transforms are important methods in the analysis nd processing of images. Image color transform and its inverse ransform should be reversible for lossless image processing appliations. However, color conversions are not reversible due to finite recision of the conversion coefficients. To overcome this limitation, eversible color transforms have been developed. Color integer ransf...

متن کامل

Efficient canonic signed digit recoding

In this work novel-efficient implementations to convert a two’s complement binary number into its canonic signed digit (CSD) representation are presented. In these CSD recoding circuits two signals, H and K, functionally equivalent to two carries are described. They are computed in parallel reducing the critical path and they possess some properties that lead to a simplification of the algebrai...

متن کامل

Modular Multipliers Using a Modified Residue Addition Algorithm with Signed-Digit Number Representation

In this paper, we present multipliers using a modified addition algorithm modulo m with a signed-digit(SD) number representation where m = 2 − 1, 2 or 2 + 1. To simplify an SD modular adder, new addition rules are proposed for generating the intermediate sum and carry with a binary number representation. By using the new codes for intermediate sum and carry and the end-around carry architecture...

متن کامل

Computation Sharing Programmable FIR Filter Using Canonic Signed Digit Representation

This paper presents a low-cost and highperformance programmable digital finite impulse response (FIR) filter. The architecture employs the computation sharing algorithm to reduce the computation complexity. In the traditional computation sharing algorithm, critical path constraint on the output summation stage is a bottleneck, thus, the canonic-sign-digit representation is utilized for filter c...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEICE Electronics Express

سال: 2014

ISSN: 1349-2543

DOI: 10.1587/elex.11.20130955